[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Sorts a list or array in place. A supplied IComparer<T> is used
to compare the items in the list.
Namespace: Wintellect.PowerCollections
Assembly:
PowerCollections (in PowerCollections.dll)
Syntax
| C# |
|---|
public static void SortInPlace<T>( IList<T> list, IComparer<T> comparer ) |
| Visual Basic (Declaration) |
|---|
Public Shared Sub SortInPlace(Of T) ( _ list As IList(Of T), _ comparer As IComparer(Of T) _ ) |
| Visual C++ |
|---|
public: generic<typename T> static void SortInPlace ( IList<T>^ list, IComparer<T>^ comparer ) |
Parameters
- list
- IList<(Of <T>)>
The list or array to sort.
- comparer
- IComparer<(Of <T>)>
The comparer instance used to compare items in the collection. Only the Compare method is used.
Type Parameters
- T
Remarks
The Quicksort algorithms is used to sort the items. In virtually all cases, this takes time O(N log N), where N is the number of items in the list.
Although arrays cast to IList<T> are normally read-only, this method will work correctly and modify an array passed as list.
See Also
Algorithms Class
Wintellect.PowerCollections Namespace
Send comments about this topic to Microsoft.